Communication: Generalized canonical purification for density matrix minimization
نویسندگان
چکیده
منابع مشابه
Canonical density matrix perturbation theory.
Density matrix perturbation theory [Niklasson and Challacombe, Phys. Rev. Lett. 92, 193001 (2004)] is generalized to canonical (NVT) free-energy ensembles in tight-binding, Hartree-Fock, or Kohn-Sham density-functional theory. The canonical density matrix perturbation theory can be used to calculate temperature-dependent response properties from the coupled perturbed self-consistent field equat...
متن کاملComputing codimensions and generic canonical forms for generalized matrix products
A generalized matrix product can be formally written as A sp p A sp−1 p−1 · · ·A s2 2 A s1 1 , where si ∈ {−1,+1} and (A1, . . . , Ap) is a tuple of (possibly rectangular) matrices of suitable dimensions. The periodic eigenvalue problem related to such a product represents a nontrivial extension of generalized eigenvalue and singular value problems. While the classification of generalized matri...
متن کاملThe Nonnegative Zero-Norm Minimization Under Generalized Z-Matrix Measurement
In this paper, we consider the l0 norm minimization problem with linear equation and nonnegativity constraints. By introducing the concept of generalized Z-matrix for a rectangular matrix, we show that this l0 norm minimization with such a kind of measurement matrices and nonnegative observations can be exactly solved via the corresponding lp (0 < p ≤ 1) norm minimization. Moreover, the lower b...
متن کاملMinimization for Generalized Boolean Formulas
The minimization problem for propositional formulas is an important optimization problem in the second level of the polynomial hierarchy. In general, the problem is Σp2-complete under Turing reductions, but restricted versions are tractable. We study the complexity of minimization for formulas in two established frameworks for restricted propositional logic: The Post framework allowing arbitrar...
متن کاملIterative Reweighted Algorithms for Matrix Rank Minimization Iterative Reweighted Algorithms for Matrix Rank Minimization
The problem of minimizing the rank of a matrix subject to affine constraints has many applications in machine learning, and is known to be NP-hard. One of the tractable relaxations proposed for this problem is nuclear norm (or trace norm) minimization of the matrix, which is guaranteed to find the minimum rank matrix under suitable assumptions. In this paper, we propose a family of Iterative Re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Chemical Physics
سال: 2016
ISSN: 0021-9606,1089-7690
DOI: 10.1063/1.4943213